Solving routing problems with pairwise synchronization constraints
نویسندگان
چکیده
منابع مشابه
Solving Routing Problems with Cellular Automata
New variants of the classical Lee algorithm for the routing of connections on printed circuits or chips have been found when mapping it onto the cellular processing model. Two cellular algorithms are described: (1) a cellular shortest path algorithm with only 14 states per cell, which is independent of the grid size and (2) a parallel algorithm for routing multiple nets simultaneously. 1 Motiva...
متن کاملSolving Unbalanced Transportation Problems with Budgetary Constraints
A new method namely, interval-point method without using fuzzy set theory is proposed for finding an optimal solution for unbalanced transportation problems with budgetary constraints where demand and budget are imprecise. With the help of numerical example, the proposed method is illustrated. The proposed method enables the decision makers to choose the optimal distribution according to their ...
متن کاملModelling and Solving Problems with Constraints
The CHOCO (CHic, un Outil Contraintes avec des Objets – great, a constraint programming tool with objects) constraint programming system is an emanation of the French OCRE (Outil Contraintes pour la Recherche et l’Enseignement – a constraint tool for research and teaching) group. Choco is a java library for constraint satisfaction problems, constraint programming, and explanation-based constrai...
متن کاملLocation-Routing Problems with Distance Constraints
A important aspect of designing a distribution system is determining the locations of the facilities. For systems in which deliveries are made along multiple stop routes, the routing problem and location problem must be considered simultaneously. In this paper, a set-partitioning-based formulation of an uncapacitated location-routing model with distance constraints is presented. An alternate se...
متن کاملA Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints
Vehicle routing problems with multiple synchronization constraints (VRPMSs) are problems that exhibit, in addition to the usual task covering constraints present in any VRP, further synchronization requirements between the vehicles, concerning spatial, temporal, and load aspects. They have only recently caught the attention of scientists and are currently a very active field of research. This p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2018
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-018-0520-4